Constructions of linear codes with small hulls from association schemes

نویسندگان

چکیده

<p style='text-indent:20px;'>The intersection of a linear code and its dual is called the hull this code. The complementary (LCD) if dimension zero. In paper, we develop method to construct LCD codes with one-dimensional by association schemes. One constructions in paper generalizes that associated Gauss periods given [<xref ref-type="bibr" rid="b5">5</xref>]. addition, present generalized construction codes, which can provide more hull. We also some examples MDS, almost MDS from our constructions.</p>

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear constructions for DNA codes

In this paper we translate in terms of coding theory constraints that are used in designingDNAcodes for use in DNA computing or as bar-codes in chemical libraries. We propose new constructions for DNA codes satisfying either a reverse-complement constraint, a GC-content constraint, or both, that are derived from additive and linear codes over four-letter alphabets. We focus in particular on cod...

متن کامل

Linear Authentication Codes from Free Modules: Bounds and Constructions

In this paper, we principally introduce a new class of unconditionally secure authentication codes, called linear authentication codes(or linear A-codes)from free modules. We then derive an upper bound on the size of source space when other parameters of the system, that is, the sizes of the key space and authenticator space, and the deception probability are fixed. We give constructions that a...

متن کامل

Imprimitive cometric association schemes: Constructions and analysis

Dualizing the “extended bipartite double” construction for distance-regular graphs, we construct a new family of cometric (or Q-polynomial) association schemes with four associate classes based on linked systems of symmetric designs. The analysis of these new schemes naturally leads to structural questions concerning imprimitive cometric association schemes, some of which we answer with others ...

متن کامل

Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes

In this paper we investigate combinatorial properties and constructions of two recent topics of cryptographic interest namely frameproof codes for digital ngerprinting and traceability schemes for broadcast encryption We rst give combinatorial descriptions of these two objects in terms of set systems and also discuss the Hamming distance of frameproof codes when viewed as error correcting codes...

متن کامل

Double circulant codes from two class association schemes

Two class association schemes consist of either strongly regular graphs (SRG) or doubly regular tournaments (DRT). We construct self-dual codes from the adjacency matrices of these schemes. This generalizes the construction of Pless ternary Symmetry codes, Karlin binary Double Circulant codes, Calderbank and Sloane quaternary double circulant codes, and Gaborit Quadratic Double Circulant codes ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Mathematics of Communications

سال: 2022

ISSN: ['1930-5346', '1930-5338']

DOI: https://doi.org/10.3934/amc.2020114